Have We Witnessed a Real-Life Turing Test?
نویسنده
چکیده
BM’s announcement of its intention to “retire” the Deep Blue computer from chess revived the interest of both the mass media and the general public in the chess match between World Champion Gary Kasparov and Deep Blue. In a sense, by refusing a rematch with Kasparov or a new match with another grand master, IBM closes a chapter in the history of artificial intelligence. AI researchers had long investigated building a machine that could defeat a world-class chess champion, and now one had. But what did this mean?
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملBayesian perspective over time
Thomas Bayes, the founder of Bayesian vision, entered the University of Edinburgh in 1719 to study logic and theology. Returning in 1722, he worked with his father in a small church. He also was a mathematician and in 1740 he made a novel discovery which he never published, but his friend Richard Price found it in his notes after his death in 1761, reedited it and published it. But until L...
متن کاملA Generative Computational Model for Human Hide and Seek Behavior
Hiding and seeking is a cognitive ability frequently demonstrated by humans in both real life and video games. We use machine learning to automatically construct the first computational model of hide/seek behavior in adult humans in a video game like setting. The model is then run generatively in a novel environment and its behavior is found indistinguishable from actual human behavior by a pan...
متن کاملPlastic machines: behavioural diversity and the Turing test
After proposing the Turing Test, Alan Turing himself considered a number of objections to the idea that a machine might eventually pass it. One of the objections discussed by Turing was that no machine will ever pass the Turing Test because no machine will ever “have as much diversity of behaviour as a man”. He responded as follows: the “criticism that a machine cannot have much diversity of be...
متن کاملClassification Techniques for Categorization of Hypertext Documents
In this paper we investigate techniques for categorization of hypertext documents. Recent years have witnessed a growing interest in applying text categorization techniques to the Web. However, the semi-structured nature of the Web along with diverse subject matter present in it pose interesting challenges for conventional classification techniques. In this paper, we review some of the techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Computer
دوره 32 شماره
صفحات -
تاریخ انتشار 1999